منابع مشابه
A General Form of Relative Recursion
The purpose of this note is to observe a generalization of the concept “computable in. . . ” to arbitrary partial combinatory algebras. For every partial combinatory algebra (pca) A and every partial endofunction on A, a pca A[f ] is constructed such that in A[f ], the function f is representable by an element; a universal property of the construction is formulated in terms of Longley’s 2-categ...
متن کاملA Relative Laplacian Spectral Recursion
The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and the relative simplicial pair of the deletion modulo the contraction. We generalize this recursion to relative simplicial pairs, which we interpret as convex ...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملThe General Form of γ-Family of Quantum Relative Entropies
We use the Falcone–Takesaki non-commutative flow of weights and the resulting theory of non-commutative Lp spaces in order to define the family of relative entropy functionals that naturally generalise the quantum relative entropies of Jenčová– Ojima and the classical relative entropies of Zhu–Rohwer, and belong to an intersection of families of Petz relative entropies with Bregman relative ent...
متن کاملVernacular Programming: General Recursion
This paper provides a mathematical analysis of the relationship between vernacular and for-malised derivations of programs; in particular, when the vernacular derivations deploy general recursion. We introduce a calculus VPD to represent vernacular derivations and a constructive theory of operations and types, EOT , to represent formal derivations. We provide an intensional semantics for VPD wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2006
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1163775438